Synthesis of Reversible Logic

A function is reversible if each input vector produces a unique output vector. Reversible functions find many applications, especially in low power design, quantum computing, optical computing, and nanotechnology. Logic synthesis for reversible circuits differs substantially from traditional logic synthesis and is an active field of research at the moment. In this paper, we present the first practical synthesis algorithm and tool for reversible functions with a large number of inputs. It uses positive-polarity Reed-Muller decomposition at each stage to synthesize the function as a network of Toffoli gates. The heuristic uses a priority queue based search tree. It explores candidate factors at each stage in order of their attractiveness, leading to a fast synthesis algorithm. The algorithm produces near-optimal results for the examples discussed in the literature. The key contribution of the work is that the heuristic finds very good solutions for reversible functions with a large number of variables.